منابع مشابه
Completions of P-matrix patterns
A list of positions in an n × n real matrix (a pattern) is said to have P-completion if every partial P-matrix that specifies exactly these positions can be completed to a P-matrix. We extend work of Johnson and Kroschel [JK] by proving a larger class of patterns has Pcompletion, including any 4 × 4 pattern with eight or fewer off-diagonal positions. We also show that any pattern whose digraph ...
متن کاملMatrix Completions , Norms and Hadamard Productsroy
Let M m;n (respectively, H n) denote the space of m n complex matrices (respectively, n n Hermitian matrices). Let S H n be a closed convex set. We obtain necessary and suucient conditions for X 0 2 S to attain the maximum in the following concave maximization problem: maxf min (A + X) : X 2 Sg where A 2 H n is a xed matrix. Let denote the Hadamard (entrywise) product, i.e., given matrices A = ...
متن کاملCompleting block Hermitian matrices with maximal and minimal ranks and inertias
For a Hermitian matrix with its main block diagonal given, this paper shows how to choose the off-diagonal blocks such that the resulting matrix has the maximal and minimal possible ranks and inertias, respectively. Some direct consequences and applications are also given.
متن کاملA Matrix and Its Inverse: Revisiting Minimal Rank Completions
We revisit a formula that connects the minimal ranks of triangular parts of a matrix and its inverse and relate the result to structured rank matrices. We also address the generic minimal rank problem.
متن کاملMatrix Extensions and Eigenvalue Completions, the Generic Case
In this paper we provide new necessary and sufficient conditions for the so-called eigenvalue completion problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 1998
ISSN: 0895-4798,1095-7162
DOI: 10.1137/s0895479895296471